Solving Fair Exchange with Mobile Agents
نویسندگان
چکیده
Mobile agents have been advocated to support electronic commerce over the Internet. While being a promising paradigm, many intricate problems need to be solved to make this vision reality. The problem of fair exchange between two agents is one such fundamental problem. Informally speaking, this means to exchange two electronic items in such a way that neither agent suffers a disadvantage. We study the problem of fair exchange in the mobile agent paradigm. We show that while existing protocols for fair exchange can be substantially simplified in the context of mobile agents, there are still many problems related to security which remain difficult to solve. We propose three increasingly flexible solutions to the fair exchange problem and show how to implement them using existing agent technology. The basis for ensuring the security properties of fair exchange is a tamper-proof hardware device called a trusted processing environment.
منابع مشابه
Fair Exchange
transition relations. In Proc. 16th Ann. IEEE Symp. on Logic in Computer Science, Boston, MA, June, pp. 51–58.IEEE Computer Society Press, Los Alamitos, CA. [77] Kremer, S. and Raskin, J.-F. (2002) Game analysis of abuse-free contract signing. In Proc. 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada,June. IEEE Computer Society Press, Los Alamitos, ...
متن کاملFair Exchange Is Incomparable to Consensus
In asynchronous systems where processes are prone to crash failures, we show that fair exchange is incomparable to distributed consensus. By incomparability we mean there exist failure detector classes that solve fair exchange and not distributed consensus, and vice versa. Remarkably, this is in contrast to the folklore belief that solving fair exchange is generally harder than solving distribu...
متن کاملTrust Based Efficiency for Cake Cutting Algorithms
Fair division methods offer guarantees to agents of the proportional size or quality of their share in a division of a resource (cake). These guarantees come with a price. Standard fair division methods (or “cake cutting” algorithms) do not find efficient allocations (not Pareto optimal). The lack of efficiency of these methods makes them less attractive for solving multi-agent resource and tas...
متن کاملCan trust increase the efficiency of cake cutting algorithms?
Fair division methods offer guarantees to agents of the proportional size or quality of their share in a division of a resource (cake). These guarantees come with a price. Standard fair division methods (or ”cake cutting” algorithms) do not find efficient allocations (not Pareto optimal). The lack of efficiency of these methods makes them less attractive for solving multi-agent resource and tas...
متن کاملA traceable optimistic fair exchange protocol in the standard model
An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...
متن کامل